Traffic Control in Wormhole Routing Meshes under Non-Uniform Traffic Patterns
نویسندگان
چکیده
Nonuniform traffic patterns can severely degrade the performance of wormhole-routing mesh networks in multiprocessor systems. For example, under a temporary hot-spot traffic, a saturation tree might build up temporarily within the network resulting in a temporary network overload that will delay messages substantially. To the knowledge of the authors, no mechanisms were proposed in the open literature so far that are able to control (rather than just route) the traffic flow under those traffic scenarios. This paper introduces and studies several channel assignment strategies for wormhole routers using virtual channels. One proposed assignment strategy is able to effectively control the degrading effects of saturation trees on the uniform background traffic under nonuniform traffic patterns that
منابع مشابه
Traffic Control in Wormhole-routing Multistage Interconnection Networks
Nonuniform traffic patterns can severely degrade the performance of wormhole-routing multistage interconnection networks in multiprocessor systems. A wormhole-routing switch box architecture is proposed that is able to control the degrading effects of saturation trees on the uniform background traffic under nonuniform traffic patterns that are known a priori. An alternating priority mechanism i...
متن کاملAn Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic
Several analytical models of fully-adaptive routing have recently been proposed for wormhole-routed k-ary ncubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. ...
متن کاملLIFE: a limited injection, fully adaptive, recovery-based routing algorithm
Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of deadlock-free algorithms. The past few years have seen a rise in popularity of deadlock recovery strategies, that are based on the property that deadlocks are quite rare in practice and happen only at or beyond the network saturation point. In fact, recovery-based routing algorithms ...
متن کاملTotal-Exchange on Wormhole k-ary n-cubes with Adaptive Routing
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching. This algorithm is based on an important property of the wormhole...
متن کاملEfficient Total-Exchange in Wormhole-Routed Toroidal Cubes
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on a toroidal mesh with wormhole switching. This algorithm is based on an important property of the wormhole networks that reach high perform...
متن کامل